CISS: An Efficient Object Clustering Framework for DHT-Based Peer-to-Peer Applications
نویسندگان
چکیده
In most DHT-based peer-to-peer systems, objects are totally declustered since such systems use a hash function to distribute objects evenly. However, such an object de-clustering can result in significant inefficiencies in advanced access operations such as multi-dimensional range queries, continuous updates, etc, which are common in many emerging peer-to-peer applications. In this paper, we propose CISS (Cooperative Information Sharing System), a framework that supports efficient object clustering for DHT-based peer-to-peer applications. CISS uses a Locality Preserving Function (LPF) instead of a hash function, thereby achieving a high level of clustering without requiring any changes to existing DHT implementations. To maximize the benefit of object clustering, CISS provides efficient routing protocols for multi-dimensional range queries and continuous updates. Furthermore, our cluster-preserving load balancing schemes distribute loads without hotspots while preserving the object clustering property. We demonstrate the performance benefits of CISS through extensive simulation. 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Enhancing Data Locality in a Fully Decentralised P2P Cycle Stealing Framework
Peer-to-peer (P2P) networks such as Gnutella and BitTorrent have revolutionised Internet based applications. P2P approaches provide a number of benefits, however most cycle stealing projects, such as SETI@home, have concentrated on centralised methods which still require massive amounts of concentrated network bandwidth in order to scale. More recent P2P research has developed the concept of di...
متن کاملP2P Views Over Annotated Documents
We consider the efficient, scalable management of XML documents in structured peer-to-peer networks based on distributed hash table (DHT) indices and present an approach for answering queries by exploiting materialized views deployed in the DHT network independently by the peers. We describe how our approach can be employed to also handle RDF-annotated documents and provide algorithms to index ...
متن کاملHierarchical architectures in structured peer-to-peer overlay networks
Distributed Hash Tables (DHT) are presently used in several large-scale systems in the Internet and envisaged as a key mechanism to provide identifier-locator separation for mobile hosts in Future Internet. Such P2P-based systems become increasingly complex serving popular social networking, resource sharing applications, and Internet-scale infrastructures. Hierarchy is a standard mechanism for...
متن کاملSuitability of Dht-based Peer-to-peer Session Initiation Protocol for Wireless Distributed Services
Providing both analytical and empirical results, we analyze the suitability of DHT-based Peer-to-Peer Session Initiation Protocol (P2PSIP) overlay networking as a substrate for wireless, distributed multimedia services. Session initiation is just one application of this framework. First, we discuss the potential of P2PSIP for different applications and analyze the security and reliability of P2...
متن کاملA Proximity-Based Self-Organizing Hierarchical Overlay Framework for Distributed Hash Tables
Several structured peer-to-peer networks have been created to solve the scalability problem of previous peer-to-peer systems such as Gnutella and Napster. These peer-to-peer networks which support distributed hash table functionality construct a sort of structured overlay network, which can cause a topology mismatch between the overlay and the underlying physical network. To solve this mismatch...
متن کامل